Distributed Calculation of PageRank Using Strongly Connected Components
نویسنده
چکیده
We provide an approach to distribute the calculation of PageRank, by splitting the graph into its strongly connected components. As we prove, the global ranking may be calculated componentwise, as long as the rankings of pages directly linking to the current component are already known. Depending on the structure of the WWW, this approach approach may be used to calculate the ranking on several components in parallel, and allows to split the problem intio significantly small subproblems.
منابع مشابه
Graph partitioning and a componentwise PageRank algorithm
In this article we will present a graph partitioning algorithm which partitions a graph into two different types of components: the well-known ‘strongly connected components’ as well as another type of components we call ‘connected acyclic component’. We will give an algorithm based on Tarjan’s algorithm for finding strongly connected components used to find such a partitioning. We will also sh...
متن کاملA Singular Perturbation Approach for Choosing the PageRank Damping Factor
We study the PageRank mass of principal components in a bow-tie Web Graph, as a function of the damping factor c. It is known that the Web graph can be divided into three principal components: SCC, IN and OUT. The Giant Strongly Connected Component (SCC) contains a large group of pages all having a hyper-link path to each other. The pages in the IN (OUT) component have a path to (from) the SCC,...
متن کاملLarge scale properties of the Webgraph
In this paper we present an experimental study of the properties of web graphs. We study a large crawl from 2001 of 200M pages and about 1.4 billion edges made available by the WebBase project at Stanford [17]. We report our experimental findings on the topological properties of such graphs, such as the number of bipartite cores and the distribution of degree, PageRank values and strongly conne...
متن کاملDecomposition of the Google PageRank and Optimal Linking Strategy
We provide the analysis of the Google PageRank from the perspective of the Markov Chain Theory. First we study the Google PageRank for a Web that can be decomposed into several connected components which do not have any links to each other. We show that in order to determine the Google PageRank for a completely decomposable Web, it is sufficient to compute a subPageRank for each of the connecte...
متن کاملLocal Partitioning for Directed Graphs Using PageRank
A local partitioning algorithm finds a set with small conductance near a specified seed vertex. In this paper, we present a generalization of a local partitioning algorithm for undirected graphs to strongly connected directed graphs. In particular, we prove that by computing a personalized PageRank vector in a directed graph, starting from a single seed vertex within a set S that has conductanc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005